From Large to Small Alphabets: Code Concatenation
ثبت نشده
چکیده
The material in this chapter is supported in part by the National Science Foundation under CAREER grant CCF-0844796. Any opinions, findings and conclusions or recomendations expressed in this material are those of the author(s) and do not necessarily reflect the views of the
منابع مشابه
Lower bounds on the minimum distance of long codes in the Lee metric
The Gilbert type bound for codes in the title is reviewed, both for small and large alphabets. Constructive lower bounds better than these existential bounds are derived from geometric codes, either over Fp or Fp2 , or over even degree extensions of Fp. In the latter case the approach is concatenation with a good code for the Hamming metric as outer code and a short code for the Lee metric as a...
متن کاملList Decodability of Random Linear Concatenated Codes
Ñ . These results are shown by choosing the code at random. However, as we saw in Chapter 4 the explicit constructions of codes over finite alphabets are nowhere close to achieving list-decoding capacity. The linear codes in Chapter 4 are based on code concatenation. A natural question to ask is whether linear codes based on code concatenation can get us to list-decoding capacity for fixed al...
متن کاملQuasi-Cyclic Complementary Dual Code
LCD codes are linear codes that intersect with their dual trivially. Quasi-cyclic codes that are LCD are characterized and studied by using their concatenated structure. Some asymptotic results are derived. Hermitian LCD codes are introduced to that end and their cyclic subclass is characterized. Constructions of QCCD codes from codes over larger alphabets are given.
متن کاملLecture 4: Codes based on Concatenation
In the last lecture, we studied codes based on univarite polynomials, also known as Reed-Solomon codes, and on multivariate polynomials, also known as Reed-Muller codes. The Reed-Solomon codes had rate R = 1 − δ, which is optimal (given by the Singleton bound), but required alphabets of large size (|Σ| ≥ n). Multivariate polynomials in a constant number of variables, however, gave codes of posi...
متن کاملThe capacity of low-density parity-check codes under message-passing decoding
In this paper, we present a general method for determining the capacity of low-density parity-check (LDPC) codes under message-passing decoding when used over any binary-input memoryless channel with discrete or continuous output alphabets. Transmitting at rates below this capacity, a randomly chosen element of the given ensemble will achieve an arbitrarily small target probability of error wit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013